ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs
نویسندگان
چکیده
Scalable and efficient algorithms are needed to compute shortest paths between any pair of vertices in large social graphs. In this work, we propose a novel ROBE scheme to estimate the shortest distances. ROBE is based on a hub serving as the skeleton of the large graph. In order to stretch the hub into every corner in the network, we first choose representative nodes with highest degrees that are at least two hops away from each other. Then bridge nodes are selected to connect the representative nodes. Extension nodes are also added to the hub to ensure that the originally connected parts in the large graph are not separated in the hub graph. To improve performance, we compress the hub through chain collapsing, tentacle retracting, and clique compression techniques. A query evaluation algorithm based on the compressed hub is given. We compare our approach with other state-of-the-art techniques and evaluate their performance with respect to miss rate, error rate, as well as construction time through extensive simulations. ROBE is demonstrated to be two orders faster and has more accurate estimations than two recent algorithms, allowing it to scale very well in large social graphs.
منابع مشابه
Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks
Shortest path computation is one of the most fundamental operations for managing and analyzing large social networks. Though existing techniques are quite effective for finding the shortest path on large but sparse road networks, social graphs have quite different characteristics: they are generally non-spatial, non-weighted, scale-free, and they exhibit small-world properties in addition to th...
متن کاملAlgorithmic and Hardness Results for the Hub Labeling Problem
There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the hub labeling framework. In this paper, we study the approximability of the Hub Labeling problem. We prove a hardness of Ω(log n) for Hub Labeling, matching known approximation guarantees. The hardness result applies t...
متن کاملA RDBMS based Framework for Shortest Path Discovery with Constraint Paths
Nowadays, graphs are used in many applications and the graph size is rapidly increasing. The shortest path discovery considering constraint conditions is very important. For example, when a road is temporarily not available, paths not including the invalid road are required. In this paper, we propose an efficient RDBMS based shortest path discovery method considering constraint conditions in a ...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملBeyond Highway Dimension: Small Distance Labels Using Tree Skeletons
The goal of a hub-based distance labeling scheme for a network G = (V,E) is to assign a small subset S(u) ⊆ V to each node u ∈ V , in such a way that for any pair of nodes u, v, the intersection of hub sets S(u) ∩ S(v) contains a node on the shortest uv-path. The existence of small hub sets, and consequently efficient shortest path processing algorithms, for road networks is an empirical observ...
متن کامل